Enhanced 3-Layer Hierarchical Replication Algorithm for Data Grid

نویسندگان

  • N. Mansouri
  • Gh. Dastghaibyfard
چکیده

In Data Grid, large quantity of data files are generated and many users around the world need to access such data for their research and experiments. Replication is a key optimization technique to manage such a huge amount of data by replicating data in multiple grid sites. Replication goals are how to decrease bandwidth consumption, improve fault tolerance, and enhance scalability. Due to dynamic network characteristic and user behavior the main challenges are when and where to replicate data in order to achieve replication goals. Other challenges are improvement of data access efficiency since number and size of storage devices available in grid are limited while large sizes of data files are produced. In this paper, the performance of the 3-layer hierarchical replication algorithm is enhanced by placing the replica in the appropriate sites i.e. best site that has the highest number of access for that particular replica and uses an economic model for file deletion when there is not enough space for replica. The economic model is based on future value of a data file. The proposed algorithm is implemented by OptorSim, European Data Grid simulator. Experiment results show that the proposed strategy achieves better performance by minimizing the data access time and avoiding unnecessary replication. KeywordsData Grid; Replication; Simulation

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving Data Grids Performance by Using Modified Dynamic Hierarchical Replication Strategy

Abstract: A Data Grid connects a collection of geographically distributed computational and storage resources that enables users to share data and other resources. Data replication, a technique much discussed by Data Grid researchers in recent years creates multiple copies of file and places them in various locations to shorten file access times. In this paper, a dynamic data replication strate...

متن کامل

Dynamic Replication based on Firefly Algorithm in Data Grid

In data grid, using reservation is accepted to provide scheduling and service quality. Users need to have an access to the stored data in geographical environment, which can be solved by using replication, and an action taken to reach certainty. As a result, users are directed toward the nearest version to access information. The most important point is to know in which sites and distributed sy...

متن کامل

Increasing performance in Data grid by a new replica replacement algorithm

Data Grid provides sharing services for very large data around the world. Data replication is one of the most effective approaches to reduce access latency and response time. In addition to the benefits, replication has costs such as storage and bandwidth consumption, especially when storage space is low and limited. Therefore,  the data replacement should be done wisely. In this p...

متن کامل

A Survey of Dynamic Replication Strategies for Improving Response Time in Data Grid Environment

Large-scale data management is a critical problem in a distributed system such as cloud,P2P system, World Wide Web (WWW), and Data Grid. One of the effective solutions is data replicationtechnique, which efficiently reduces the cost of communication and improves the data reliability andresponse time. Various replication methods can be proposed depending on when, where, and howreplicas are gener...

متن کامل

Hierarchical Replication Strategy for Adaptive Scoring Job Scheduling in Grid Computing

Grid technology, which together a number of personal computer clusters with high speed networks, can reach the same computing power as a supercomputer does, also with a minimum cost. However, heterogeneous system is called as grid. Scheduling independent tasks on grid is more difficult. In order to utilize the power of grid completely, we demand an efficient job scheduling algorithm to execute ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011